On the Time Complexity of the Dining Philosophers Problem
نویسندگان
چکیده
منابع مشابه
Dining Philosophers, Leader Election and Ring Size problems, in the quantum setting
We provide the first quantum (exact) protocol for the Dining Philosophers problem (DP), a central problem in distributed algorithms. It is well known that the problem cannot be solved exactly in the classical setting. We then use our DP protocol to provide a new quantum protocol for the tightly related problem of exact leader election (LE) on a ring, improving significantly in both time and mem...
متن کاملA Distributed Algorithm in Agda: the Dining Philosophers Problem
One distributed algorithm for the dining philosophers problem 1] is implemented in Agda, a proof checker based on Martin-LL of's type theory. The correctness proof of the algorithm is outlined and the diiculties are discussed.
متن کاملProgress with Java threads as dining philosophers
The classical problem of the dining philosphers is solved and implemented with Java threads, without central coordination. Apart from the initialization the program is symmetric. The philosophers are the synchronized objects whereas the forks between the philosophers are unsynchronized. It is proved that every hungry philosopher eats within bounded delay, in a certain formalized sense.
متن کاملPetri Nets as Integrated Modelling Techniques
3 Review of Place/Transition Nets 8 3.1 “Dining Philosophers” as PT Net . . . . . . . . . . . . . . . . . . 8 3.2 Place/Transition Nets . . . . . . . . . . . . . . . . . . . . . . . . 9 3.3 Marking Graphs . . . . . . . . . . . . . . . . . . . . . . . . . . . 10 3.4 A “Dining Philosophers” Process . . . . . . . . . . . . . . . . . . 12 3.5 Occurence Nets and Processes . . . . . . . . . . . . . ....
متن کاملThe Weakest Failure Detector for Solving Wait-Free, Eventually Bounded-Fair Dining Philosophers
The Weakest Failure Detector for Solving Wait-Free, Eventually Bounded-Fair Dining Philosophers. (December 2008) Yantao Song, B.S., Beijing Institute of Technology; M.S., Chinese Academy of Sciences Chair of Advisory Committee: Dr. Scott M. Pike This dissertation explores the necessary and sufficient conditions to solve a variant of the dining philosophers problem. This dining variant is define...
متن کامل